431A - Black Square - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define For(i, s, e) for (ll i = s; i < e; i++)
#define FoR(i, s, e) for (ll i = s; i <= e; i++)
#define deFoR(i, s, e) for (ll i = s; i >= e; i--)
#define pb push_back
#define vii vector<ll>
#define makep make_pair
#define vpll vector<pair<ll, ll>>
#define fi first
#define se second
#define sii set<ll>
#define pii pair<int, int>
#define rev(c) reverse(c.begin(), c.end())
#define sortf(c) sort(c.begin(), c.end())
#define test()   \
    int test;    \
    cin >> test; \
    while (test--)
#define fast()                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0);
#define sqr(n) (n)*(n)
#define len(s) (s.length())

ll const max2d = 1e4 + 7;
ll const N = 1e6 + 7;
ll const inf = 1e9 + 7;
char const nl = '\n';

// ! ¸,ø¤º°`°º¤ø,¸¸,ø¤º° [ нvмegy ] °º¤ø,¸¸,ø¤º°`°º¤ø,¸ roadтoнυe

void solve() {
    
}


signed main()
{
    fast();

    int a[5];
    FoR(i, 1, 4) { 
        cin >> a[i];
    }
    string s; 
    cin >> s; 
    int sum = 0; 
    FoR(i, 0, len(s)-1) { 
        sum += a[s[i]-48];
    }
    cout << sum;
    return 0;
}